7 research outputs found

    On the Capacity Region of the Deterministic Y-Channel with Common and Private Messages

    Full text link
    In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to characterize. The prior art used simple linear deterministic models in order to approximate the capacities of these Gaussian networks. This paper discusses the capacity region of the deterministic Y-channel with private and common messages. In this channel, each user aims at delivering two private messages to the other two users in addition to a common message directed towards both of them. As there is no direct link between the users, all messages must pass through an intermediate relay. We present outer-bounds on the rate region using genie aided and cut-set bounds. Then, we develop a greedy scheme to define an achievable region and show that at a certain number of levels at the relay, our achievable region coincides with the upper bound. Finally, we argue that these bounds for this setup are not sufficient to characterize the capacity region.Comment: 4 figures, 7 page

    Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages

    Full text link
    In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a 4-user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the Simple Ordering Scheme (SOS) and Detour Schemes (DS). In the SOS, we order the transmitted bits at each user such that the bi-directional messages will be received at the same channel level at the relay, while the basic idea behind the DS is that some parts of the message follow an indirect path to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other.Comment: 12 pages, 5 figures, submitted to IEEE JSAC Network codin

    MIMO vehicle to vehicle channels: An experimental study

    No full text
    In this paper, a platform for measuring the impulse response of wireless multiple-input-multiple-output (MIMO) vehicle-to-vehicle (V2V) channels is presented. The platform is developed using Rice University Wireless Open-Access Research Platform (WARP) boards and utilized to perform an experimental study of V2V channels through conducting field measurements. A full characterization of MIMO-V2V channels is given via extracting the channel parameters from the acquired measurements. These parameters include the power-delay profile, the Doppler spectrum, and the MIMO transmit and receive correlation matrices of the channel. Numerical simulations are utilized to examine the effect of the channel parameters on the bit error rate (BER) performance of an orthogonal frequency division multiplexing (OFDM) based system.General Motors, USA.Scopu
    corecore